Estimating probability distributions of dynamic queues
نویسندگان
چکیده
منابع مشابه
Estimating Probability Distributions by Observing Betting Practices
A bookmaker takes bets on a two-horse race, attempting to minimise expected loss over all possible outcomes of the race. Profits are controlled by manipulation of customers’ betting behaviour; in order to do this, we need some information about the probability distribution which describes how the customers will bet. We examine what information initial customers’ betting behaviour provides about...
متن کاملEstimating Probability Distributions over Hypotheses with Variable Unification
We analyze the difficulties in applying Bayesian belief networks to language interpretation domains, which typically involve many unification hypotheses that posit variable bindings. As an alternative, we observe that the structure of the underlying hypothesis space permits an approximate encoding of the joint distribution based on marginal rather than conditional probabilities. This suggests a...
متن کاملProbability MEDIUM ACCESS USING QUEUES
Consider a wireless network of n nodes represented by a graph G = (V,E) where an edge (i, j) ∈ E models the fact that transmissions of i and j interfere with each other, i.e. simultaneous transmissions of i and j become unsuccessful. Hence it is required that at each time instance a set of non-interfering nodes (corresponding to an independent set in G) access the wireless medium. To utilize wi...
متن کاملConflations of Probability Distributions
The conflation of a finite number of probability distributions P1, . . . , Pn is a consolidation of those distributions into a single probability distribution Q = Q(P1, . . . , Pn), where intuitively Q is the conditional distribution of independent random variables X1, . . . ,Xn with distributions P1, . . . , Pn, respectively, given that X1 = · · · = Xn. Thus, in large classes of distributions ...
متن کاملApproximability of Probability Distributions
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures the degree of approximability as a tradeoff between the accuracy and the complexity of approximation. We present a simple approach to analyzing achievable tradeoffs that exploits the threshold behavior of monotone gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Planning and Technology
سال: 2014
ISSN: 0308-1060,1029-0354
DOI: 10.1080/03081060.2014.976987